Permanents of Hexagonal and Armchair Chains
نویسندگان
چکیده
The permanent is important invariants of a graph with some applications in physics. If G adjacency matrix id="M2"> A = a i j , then the id="M3"> defined as id="M4"> perm open="(" close=")" ∑ σ ∈ S n stretchy="false">∏ 1 where id="M5"> denotes symmetric group on id="M6"> symbols. In this paper, general form matrices hexagonal and armchair chains will be computed. As consequence our work, it proved that if id="M7"> k id="M8"> H denote chains, respectively, id="M9"> 4 id="M10"> + 2 id="M11"> ≥ id="M12"> id="M13"> . One question about zig-zag chain also presented.
منابع مشابه
The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملThe Genus Distribution of Doubly Hexagonal Chains
By using the Transfer Matrix Method, explicit formulas for the embedding distribution of doubly hexagonal chain graphs are computed. Dedicated to Ante Graovac 1 Fasciagraphs and rotagraphs An interesting topic that I have learned from Ante Graovac in the 1980’s [1, 2] is that about fasciagraphs and rotagraphs. Such graphs are frequently studied in crystallography and in mathematical chemistry. ...
متن کاملGeneralized Wiener Indices in Hexagonal Chains
The Wiener Index, or the Wiener Number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener Index for trees, and Ivan Gutman proposed a modification of the Schultz index with...
متن کاملThe Hosoya polynomial decomposition for hexagonal chains
For a graph G we denote by dG(u, v) the distance between vertices u and v in G, by dG(u) the degree of vertex u. The Hosoya polynomial of G is H(G) = ∑ {u,v}⊆V (G) x dG (u,v). For any positive numbers m and n, the partial Hosoya polynomials of G are Hm(G) = ∑ {u, v} ⊆ V (G) dG (u) = dG (v) = m xdG (u,v), Hmn(G) = ∑ {u, v} ⊆ V (G) dG (u) = m, dG (v) = n xdG (u,v). It has been shown that H(G1) − ...
متن کاملExtremal k∗-Cycle Resonant Hexagonal Chains
Denote by B∗ n the set of all k∗-cycle resonant hexagonal chains with n hexagons. For any Bn ∈ B ∗ n , let m(Bn) and i(Bn) be the numbers of matchings (=the Hosoya index) and the number of independent sets (=the Merrifield-Simmons index) of Bn, respectively. In this paper, we give a characterization of the k∗-cycle resonant hexagonal chains, and show that for any Bn ∈ B ∗ n , m(Hn) ≤ m(Bn) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2022
ISSN: ['1687-0425', '0161-1712']
DOI: https://doi.org/10.1155/2022/7786922